cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
COND(true, x) → P(x)
COND(true, x) → EVEN(x)
EVEN(s(s(x))) → EVEN(x)
COND(true, x) → GR(x, 0)
COND(true, x) → AND(even(x), gr(x, 0))
COND(true, x) → COND(and(even(x), gr(x, 0)), p(x))
GR(s(x), s(y)) → GR(x, y)
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
COND(true, x) → P(x)
COND(true, x) → EVEN(x)
EVEN(s(s(x))) → EVEN(x)
COND(true, x) → GR(x, 0)
COND(true, x) → AND(even(x), gr(x, 0))
COND(true, x) → COND(and(even(x), gr(x, 0)), p(x))
GR(s(x), s(y)) → GR(x, y)
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
EVEN(s(s(x))) → EVEN(x)
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
EVEN(s(s(x))) → EVEN(x)
The value of delta used in the strict ordering is 3/8.
POL(EVEN(x1)) = (1/2)x_1
POL(s(x1)) = 1/4 + (2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
COND(true, x) → COND(and(even(x), gr(x, 0)), p(x))
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
COND(true, x) → COND(and(even(x), gr(x, 0)), p(x))
The value of delta used in the strict ordering is 1/8.
POL(gr(x1, x2)) = (1/2)x_1
POL(even(x1)) = 0
POL(true) = 1/2
POL(false) = 0
POL(p(x1)) = (1/4)x_1
POL(s(x1)) = 1 + (4)x_1
POL(and(x1, x2)) = x_2
POL(COND(x1, x2)) = (1/4)x_1 + (1/4)x_2
POL(0) = 0
gr(s(x), 0) → true
p(s(x)) → x
p(0) → 0
and(x, false) → false
and(false, x) → false
and(true, true) → true
gr(0, x) → false
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
cond(true, x) → cond(and(even(x), gr(x, 0)), p(x))
and(x, false) → false
and(false, x) → false
and(true, true) → true
even(0) → true
even(s(0)) → false
even(s(s(x))) → even(x)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x